Residue-to-Binary Converters for the Moduli Set {22n+1−1,22n,2n−1}
نویسندگان
چکیده
In this paper, we propose two memoryless converters for the moduli set {22n+1 − 1,2,2 − 1}. First, we propose a novel reverse converter, which is purely adder based, using the traditional Chinese Remainder Theorem (CRT). Second, due to the fact that the proposed CRT based structure does not cover the entire dynamic range, a second converter, which covers the entire dynamic range based on Mixed Radix Conversion (MRC), is proposed. The CRT based converter outperforms the MRC based converter both in terms of area and delay. In comparison with related best known state of the art converters, they are all outperformed by the proposed CRT based scheme in terms of both area cost and conversion delay. The theoretical evaluation is supported by the experimental results, which are estimated on a Standard Cell 0.13-μm CMOS technology. These experimental results indicate that, on average, for the same dynamic range, the proposed CRT based converter achieves about 23% delay reduction with more than 3% area reduction, when compared to the existing state of the art MRC based converter. Additionally, the proposed CRT based converter is about 6% faster with about 4% area reduction when compared with the existing CRT based converter.
منابع مشابه
An Improved Residue to Binary Converter Based on Mixed-Radix Conversion for the Moduli Set {22n+1−1,22n,2n−1}
The increasing usage of Residual Number System (RNS) in signal processing applications demands the development of new and more adaptable RNS moduli sets and arithmetic units. In this paper, a new reverse converter for moduli set {22n+1−1,22n ,2n− 1}, which can offers large dynamic range, is presented. We improved a previously introduced Mixed-Radix Converter architecture [1] for a high speed ha...
متن کاملA General Reverse Converter Architecture with Low Complexity and High Performance
This paper presents a general architecture for designing efficient reverse converters based on the moduli set {2α, 22β+1-1, 2β-1}, where β ≺ α 2β, by using a parallel implementation of mixed-radix conversion (MRC) algorithm. The moduli set {2α, 22β+1-1, 2β-1} is free from modulo (2k+1)-type which can result in an efficient arithmetic unit for residue number system (RNS). The values of α and β c...
متن کاملReverse Convertor Design for the 4-Moduli Set {2n −1,2n,2n +1,22n+1−1} Based on the Mixed-Radix Conversion
The residue number system (RNS) is an integer system capable of supporting high speed concurrent arithmetic. One of the most important consideration when designing RNS system is reverse conversion. The reverse converter for recently proposed for the four-moduli set {2n −1,2n,2n +1,22n+1 −1} is based on new Chinese remainder theorems II (New CRT-II) [6]. This paper presents an alternative archit...
متن کاملA Parallel Implementation of the Reverse Converter for the Moduli Set {2n, 2n–1, 2n–1–1}
In this paper, a new reverse converter for the moduli set {2n, 2n–1, 2n–1–1} is presented. We improved a previously introduced conversion algorithm for deriving an efficient hardware design for reverse converter. Hardware architecture of the proposed converter is based on carry-save adders and regular binary adders, without the requirement for modular adders. The presented design is faster than...
متن کاملAn improved RNS reverse converter for the {22n+1-1, 2n, 2n-1} moduli set
In this paper, we propose a novel high speed memoryless reverse converter for the moduli set {22n+1 − 1,2n,2n − 1}. First, we simplify the traditional Chinese Remainder Theorem in order to obtain a reverse converter that only requires arithmetic mod-(22n+1 − 1). Second, we further improve the resulting architecture to obtain a reverse converter that only uses Carry Save Adders and Carry Propaga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009